Fast Augmenting Paths by Random Sampling from Residual Graphs
نویسندگان
چکیده
منابع مشابه
Fast Augmenting Paths by Random Sampling from Residual Graphs
Consider an n-vertex, m-edge, undirected graph with integral capacities and maxflow value v. We give a new Õ(m + nv)-time maximum flow algorithm. After assigning certain special sampling probabilities to edges in Õ(m) time, our algorithm is very simple: repeatedly find an augmenting path in a random sample of edges from the residual graph. Breaking from past work, we demonstrate that we can ben...
متن کاملFast Algorithms for Diameter-Optimally Augmenting Paths
We consider the problem of augmenting a graph with n vertices embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present an exact algorithm for the cases when the input graph is a path that runs in O(n log n) time. We also present an algorithm that computes a (1 + ε)approximation in O(n+1/ε) time for paths in R, where d is a...
متن کاملCacheDiff: Fast Random Sampling
We present a sampling method called, CacheDiff, that has both time and space complexity of O(k) to randomly select k items from a pool of N items, in which N is known.
متن کاملFast Algorithms for Diameter-Optimally Augmenting Paths and Trees
We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in O(n log n) time, and (ii) the input graph is a tree, running in O(n2 logn) time. We also present an algorithm for paths that computes...
متن کاملSampling Random Colorings of Sparse Random Graphs
We study the mixing properties of the single-site Markov chain known as the Glauber dynam-ics for sampling k-colorings of a sparse random graph G(n, d/n) for constant d. The best knownrapid mixing results for general graphs are in terms of the maximum degree ∆ of the input graphG and hold when k > 11∆/6 for all G. Improved results hold when k > α∆ for graphs withgirth ≥ 5 and ∆ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2015
ISSN: 0097-5397,1095-7111
DOI: 10.1137/070705994